Modern Hash Function Construction
نویسندگان
چکیده
This paper discusses modern hash function construction using the NIST SHA-3 competition as a survey of modern hash function construction properties. Three primary hash function designs are identified based on the designs of SHA-3 candidates submitted as part of the NIST SHA-3 competition. These designs are Widepipe, Sponge, and HAsh Iterated FrAmework (HAIFA). Keywordscryptography; hashing; hash function
منابع مشابه
An Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کاملAn algebraic hash function based on SL 2 by Andrew
Cryptographic hash functions are fundamental building blocks of many computer security systems and protocols, primarily being used to ensure data integrity. Recent attacks against modern hash functions have questioned the suitability of standard hash function construction principles. In this paper we consider a hash function construction based multiplication in the group of 2× 2 matrices over a...
متن کاملNew hash function designs
1 Known designs Let n be a natural number and M denotes the message represented by n-bit In case the message length is not a multiple of n, it should be padded somehow. We do not specify how at this point. Most of the known hash functions are based on the Merkle-Damg ˙ ard construction. First, a compression function f (h, m) is determined, where m is an n-bit input and another input h is of the...
متن کاملOn iteration-based security flaws in modern hash functions
The design principles proposed independently by both Ralph Merkle and Ivan Damgård in 1989 are applied widely in hash functions that are used in practice. The construction reads the message in one message block at a time and applies iteratively a compression function that, given a single message block and a hash value, outputs a new hash value. This iterative structure has some security weaknes...
متن کاملEfficient Hash Function for Duplicate Elimination in Dictionaries
Fast elimination of duplicate data is needed in many areas, especially in the textual data context. A solution to this problem was recently found for geometrical data using a hash function to speed up the process. The usage of the hash function is extremely efficient when incremental elimination is required especially for processing large data sets. In this paper a new construction of the hash ...
متن کامل